Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Channel access and resource allocation algorithm for adaptive p-persistent mobile ad hoc network
Xintong QIN, Zhengyu SONG, Tianwei HOU, Feiyue WANG, Xin SUN, Wei LI
Journal of Computer Applications    2024, 44 (3): 863-868.   DOI: 10.11772/j.issn.1001-9081.2023030322
Abstract127)   HTML2)    PDF (2070KB)(114)       Save

For the channel access and resource allocation problem in the p-persistent Mobile Ad hoc NETwork (MANET), an adaptive channel access and resource allocation algorithm with low complexity was proposed. Firstly, considering the characteristics of MANET, the optimization problem was formulated to maximize the channel utility of each node. Secondly, the formulated problem was then transformed into a Markov decision process and the state, action, as well as the reward function were defined. Finally, the network parameters were trained based on policy gradient to optimize the competition probability, priority growth factor, and the number of communication nodes. Simulation experiment results indicate that the proposed algorithm can significantly improve the performance of p-persistent CSMA (Carrier Sense Multiple Access) protocol. Compared with the scheme with fixed competition probability and predefined p-value, the proposed algorithm can improve the channel utility by 45% and 17%, respectively. The proposed algorithm can also achieve higher channel utility compared to the scheme with fixed number of communication nodes when the total number of nodes is less than 35. Most importantly, with the increase of packet arrival rate, the proposed algorithm can fully utilize the channel resource to reduce the idle period of time slot.

Table and Figures | Reference | Related Articles | Metrics
Discrete free search algorithm
GUO Xin SUN Lijie LI Guangming JIANG Kaizhong
Journal of Computer Applications    2013, 33 (06): 1563-1570.   DOI: 10.3724/SP.J.1087.2013.01563
Abstract643)      PDF (572KB)(669)       Save
A free search algorithm was proposed for the discrete optimization problem. However,solutions simply got from free search algorithm often have crossover phenomenon. Then, an algorithm free search algorithm combined with cross elimination was put forward, which not only greatly improved the convergence rate of the search process but also enhanced the quality of the results. The experimental results using Traveling Saleman Problem (TSP) standard data show that the performance of the proposed algorithm increases by about 1.6% than that of the genetic algorithm.
Reference | Related Articles | Metrics
Improvement of dynamic multi-objective evolutionary and orthogonal test for four-branch satellite antenna
GUO Jin-cui ZOU Jin-xin SUN Peng-hui ZHUANG Yan
Journal of Computer Applications    2011, 31 (10): 2880-2882.   DOI: 10.3724/SP.J.1087.2011.02880
Abstract1376)      PDF (433KB)(519)       Save
A satellite antenna characterized by wide-beam, wide-bandwidth and microwave right-hand-circular polarization was designed. First, the Dynamic Dominant Evolution Algorithm (DDEA) was used to search globally on a parallel computing platform. Then orthogonal design and HFSS software based on finite element method were used to search within local scope evenly and elaborately, so that the antenna gain was further improved. The improved antenna meets the requirements on beam and saves the feeding power of satellite.
Related Articles | Metrics